Extremal sequences of polynomial complexity 3

نویسندگان

  • KEVIN G. HARE
  • IAN D. MORRIS
  • Kevin G. Hare
  • Ian D. Morris
  • Nikita Sidorov
چکیده

The joint spectral radius of a bounded set of d × d real matrices is defined to be the maximum possible exponential growth rate of products of matrices drawn from that set. For a fixed set of matrices, a sequence of matrices drawn from that set is called extremal if the associated sequence of partial products achieves this maximal rate of growth. An influential conjecture of J. Lagarias and Y. Wang asked whether every finite set of matrices admits an extremal sequence which is periodic. This is equivalent to the assertion that every finite set of matrices admits an extremal sequence with bounded subword complexity. Counterexamples were subsequently constructed which have the property that every extremal sequence has at least linear subword complexity. In this paper we extend this result to show that for each integer p ≥ 1, there exists a pair of square matrices of dimension 2(2−1) for which every extremal sequence has subword complexity at least 2−p 2 n.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extremal sequences of polynomial complexity

The joint spectral radius of a bounded set of d × d real matrices is defined to be the maximum possible exponential growth rate of products of matrices drawn from that set. For a fixed set of matrices, a sequence of matrices drawn from that set is called extremal if the associated sequence of partial products achieves this maximal rate of growth. An influential conjecture of J. Lagarias and Y. ...

متن کامل

Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences

We introduce a containment relation of hypergraphs which respects linear orderings of vertices and investigate associated extremal functions. We extend, by means of a more generally applicable theorem, the n log n upper bound on the ordered graph extremal function of F = ({1, 3}, {1, 5}, {2, 3}, {2, 4}) due to Füredi to the n(log n)2(log log n)3 upper bound in the hypergraph case. We use Davenp...

متن کامل

Generating Partial and Multiple Transversals of a Hypergraph

We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transversals. We show that the hypergraphs of all multiple and all partial transversals are dualbounded in the sense that in both cases, the size of the dual hypergraph is bounded by a polynomial in the cardinality and the l...

متن کامل

Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields

This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...

متن کامل

Extremal functions for sequences

Davenport-Schinzel sequences DS(s) are finite sequences of some symbols with no immediate repetition and with no alternating subsequence (i.e. of the type ababab . . .) of the length s. This concept based on a geometrical motivation is due to Davenport and Schinzel in the middle of sixties. In the late eighties strong lower and upper (superlinear) bounds on the maximum length of the DS(s) seque...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013